class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param nums int整型vector 
     * @param target int整型 
     * @return int整型
     */
    int search(vector<int>& nums, int target) {
        // write code here
        int l = 0;
        int r = nums.size() - 1;
        int mid;
        while (l <= r) {
            mid = (l+r)>>1;
            if (target < nums[mid]){
                r = mid - 1;
            } else if(nums[mid] < target){
                l = mid + 1;
            } else if (nums[mid] == target){
                return mid;
            }
        }
        return -1;
    }
};